Mathematics on Non - Mathematics — A Combinatorial Contribution

نویسنده

  • Linfan MAO
چکیده

A classical system of mathematics is homogenous without contradictions. But it is a little ambiguous for modern mathematics, for instance, the Smarandache geometry. Let F be a family of things such as those of particles or organizations. Then, how to hold its global behaviors or true face? Generally, F is not a mathematical system in usual unless a set, i.e., a system with contradictions. There are no mathematical subfields applicable. Indeed, the trend of mathematical developing in 20th century shows that a mathematical system is more concise, its conclusion is more extended, but farther to the true face for its abandoned more characters of things. This effect implies an important step should be taken for mathematical development, i.e., turn the way to extending non-mathematics in classical to mathematics, which also be provided with the philosophy. All of us know there always exists a universal connection between things in F . Thus there is an underlying structure, i.e., a vertex-edge labeled graph G for things in F . Such a labeled graph G is invariant accompanied with F . The main purpose of this paper is to survey how to extend classical mathematical non-systems, such as those of algebraic systems with contradictions, algebraic or differential equations with contradictions, geometries with contradictions, and generally, classical mathematics systems with contradictions to mathematics by the underlying structure G. All of these discussions show that a non-mathematics in classical is in fact a mathematics underlying a topological structure G, i.e., mathematical combinatorics, and contribute more to physics and other sciences.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All Ramsey (2K2,C4)−Minimal Graphs

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

متن کامل

A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs

The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...

متن کامل

Combinatorial Speculations and ̧ the Combinatorial Conjecture for Mathematics ̧

¸ maolinfan@163. com¸Abstract : Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to find combinatorial behavior for objectives. Recently, such research works appeared on journals for mathematics and theoretical...

متن کامل

m at h . G M ] 2 8 Ju n 20 06 Combinatorial Speculations and ̧ the Combinatorial Conjecture for Mathematics ̧

¸ maolinfan@163. com¸Abstract : Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an even more important work for mathematician is to apply combinatorics to other mathematics and other sciences beside just to find combinatorial behavior for objectives. In the past few years, works of this kind frequently appeared on journals fo...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014